Open Problem—Regarding Static Priority Scheduling for Many-Server Queues with Reneging

An approximation for multi-server queues with deterministic reneging times

In this paper, we studied multi-server queue with Poisson arrivals, general service time distribution, and deterministic reneging times. This work was motivated by the timeout mechanism used in managing application servers in transaction processing environments. In such systems, a customer who stays in the queue longer than the timeout period is lost. We proposed a scaling approach, and a fast ...

Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy

Fluid Limits of Many-servers Queues with Reneging

This work considers a many-server queueing system in which impatient customers with i.i.d., generally distributed service times and i.i.d., generally distributed patience times enter service in the order of arrival and abandon the queue if the time before possible entry into service exceeds the patience time. The dynamics of the system is represented in terms of a pair of measure-valued process...

Fluid limits for many-server systems with reneging

A multi-class many-server system is considered, in which customers are served according to a non-preemptive priority policy and may renege while waiting to enter service. The service and reneging time distributions satisfy mild conditions. Building on an approach developed by Kaspi and Ramanan, the Law-of-Large-Numbers many-server asymptotics are characterized as the unique solution to a set of...

Many-server Queues with Customer Abandonment

ACKNOWLEDGEMENTS I have had a phenomenal time during my four years in Georgia Tech. I attribute my good fortune to these wonderful people. First and foremost, I would like to thank my advisor, Professor Jim Dai, for his guidance and support. I will always remember him as " the advisor who made everything possible ". His friendliness, wisdom, spontaneity, and attitude of hopeful-ness made him un...